Loglog distances in a power law random intersection graph
نویسنده
چکیده
We consider the typical distance between vertices of the giant component of a random intersection graph having a power law (asymptotic) vertex degree distribution with infinite second moment. Given two vertices from the giant component we construct OP (log log n) upper bound for the length of the shortest path connecting them. key words: intersection graph, random graph, power law, giant component. AMS 2000 Subject Classification: Primary 05C80, Secondary 05C12
منابع مشابه
Recent Progress in Complex Network Analysis: Properties of Random Intersection Graphs
Experimental results show that in large complex networks (such as internet, social or biological networks) there exists a tendency to connect elements which have a common neighbor. In theoretical random graph models, this tendency is described by the clustering coefficient being bounded away from zero. Complex networks also have power-law degree distributions and short average distances (small ...
متن کاملUniversality for distances in power-law random graphs
We survey the recent work on phase transition and distances in various random graph models with general degree sequences. We focus on inhomogeneous random graphs, the configuration model and affine preferential attachment models, and pay special attention to the setting where these random graphs have a power-law degree sequence. This means that the proportion of vertices with degree k in large ...
متن کاملRecent Progress in Complex Network Analysis: Models of Random Intersection Graphs
Experimental results show that in large complex networks such as internet or biological networks, there is a tendency to connect elements which have a common neighbor. This tendency in theoretical random graph models is depicted by the asymptotically constant clustering coefficient. Moreover complex networks have power law degree distribution and small diameter (small world phenomena), thus the...
متن کاملRandom Intersection Graph Process
Vertices of an affiliation network are linked to features and two vertices are declared adjacent whenever they share a common feature. We introduce a random intersection graph process aimed at modeling sparse evolving affiliation networks. We establish the asymptotic degree distribution and provide explicit asymptotic formulas for assortativity and clustering coefficients showing how these edge...
متن کاملCoupling Online and Offline Analyses for Random Power Law Graphs
We develop a coupling technique for analyzing online models by using offline models. This method is especially effective for a growth-deletion model that generalizes and includes the preferential attachment model for generating large complex networks which simulate numerous realistic networks. By coupling the online model with the offline model for random power law graphs, we derive strong boun...
متن کامل